Equivalence of recursive specifications in process algebra

Equivalence of recursive specifications in process algebra

We define an equivalence relation on recursive specifications in process algebra that is model-independent and does not involve an explicit notion of solution. Then we extend this equivalence to the specification language μCRL.  2001 Elsevier Science B.V. All rights reserved.

Process Algebra with Recursive

Process Algebra with Recursive Operations

3 Axiomatisation of the Binary Kleene Star 15 3.1 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.2 Completeness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.3 Irredundancy of the Axioms . . . . . . . . . . . . . . . . . . . . . . . 24 3.4 Negative Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 3.5 Extensions of BPA∗(A...

Polarized Process Algebra and Program Equivalence

The basic polarized process algebra is completed yielding as a projective limit a cpo which also comprises infinite processes. It is shown that this model serves in a natural way as a semantics for several program algebras. In particular, the fully abstract model of the program algebra axioms of [2] is considered which results by working modulo behavioral congruence. This algebra is extended wi...

Markovian Process Algebra : Composition and Equivalence

Markovian Process Algebra (MPA) is a process algebra enhanced with exponential timing which allows the mapping of speciications on continuous time Markov chains (CTMCs). This paper introduces a compositional approach to compute the generator matrix of the CTMC underlying a MPA speciication which consists of the parallel composition of nite state agents. Furthermore two diierent equivalence rela...